Weakly approaching sequences of random distributions
نویسندگان
چکیده
منابع مشابه
Sturm Sequences and Random Eigenvalue Distributions
This paper proposes that the study of Sturm sequences is invaluable in the numerical computation and theoretical derivation of eigenvalue distributions of random matrix ensembles. We first explore the use of Sturm sequences to efficiently compute histograms of eigenvalues for symmetric tridiagonal matrices and apply these ideas to random matrix ensembles such as the β-Hermite ensemble. Using ou...
متن کاملOrdered Random Variables from Discontinuous Distributions
In the absolutely continuous case, order statistics, record values and several other models of ordered random variables can be viewed as special cases of generalized order statistics, which enables a unified treatment of their theory. This paper deals with discontinuous generalized order statistics, continuing on the recent work of Tran (2006). Specifically, we show that in general neither re...
متن کاملFURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES
Convergence is an issue being widely concerned about. Thus, in this paper, we mainly put forward two types of concepts of convergence in mean and convergence in distribution for the sequence of uncertain random variables. Then some of theorems are proved to show the relations among the three convergence concepts that are convergence in mean, convergence in measure and convergence in distributio...
متن کاملDensity Distributions in Random Binary Sequences Introduction: Frequency and Randomness
We start from the notion of the density of a word in a binary sequence. Given a xed binary word w of length n, let g(m; k) denote the number of distinct binary words v of length m containing just k occurences of w. An extended Central Limit Theorem can be applied to conclude that as m ! 1 so g(m; k) p 2 ?n m=2 m becomes approximately normal with mean 2 ?n m and variance s2 ?n m. We give a recur...
متن کاملWeakly Useful Sequences
An infinite binary sequence x is defined to be (i) strongly useful if there is a computable time bound within which every decidable sequence is Turing reducible to x; and (ii) weakly useful if there is a computable time bound within which all the sequences in a non-measure 0 subset of the set of decidable sequences are Turing reducible to x. Juedes, Lathrop, and Lutz (1994) proved that every we...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2000
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1014842838